Penalising Patterns in Timetables: Novel Integer Programming Formulations
نویسندگان
چکیده
Many complex timetabling problems have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component corresponds to hard constraints such as “students are in at most one place at one time” and “there is a limited number of rooms” [1]. Despite the hardness of graph colouring, it is often easy to generate feasible colourings. However, real-world timetabling systems [2] have to cope with much more challenging requirements, such as “students should not have gaps in their individual daily timetables”, which often make the problem over-constrained. The key to tackling this challenge is a suitable formulation of “soft” constraints, which count and minimise penalties incurred by matches of various patterns. Several integer programming formulations are presented and discussed in this paper. Throughout the paper, the Udine Course Timetabling Problem is used as an illustrative example of timetabling with soft constraints. The problem has been formulated by Schaerf and Di Gaspero [3, 4] at the University of Udine. Its input can be outlined as follows:
منابع مشابه
Penalising Patterns in Timetables: Strengthened Integer Programming Formulations
Many complex timetabling problems, such as university course timetabling [1, 2] and employee rostering [3], have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component corresponds to hard constraints such as “each student attends all events of courses of his choice, no student can be in two room...
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملInteger Programming and Conway's Game of Life
This article presents integer programming formulations for finding interesting patterns in Conway’s game of Life, with accompanying exercises and solutions.
متن کاملA mixed-integer branching approach for very small formulations of disjunctive constraints
Abstract We study the existence and construction of very small formulations for disjunctive constraints in optimization problems: that is, formulations that use very few integer variables and extra constraints. To accomplish this, we present a novel mixed-integer branching formulation framework, which preserves many of the favorable algorithmic properties of a traditional mixed-integer programm...
متن کاملOn the delivery robustness of train timetables with respect to production replanning possibilities
Measuring timetable robustness is a complex task. Previous efforts have mainly been focused on simulation studies or measurements of time supplements. However, these measurements don't capture the production flexibility of a timetable, which is essential for measuring the robustness with regard to the trains' commercial activity commitments, and also for merging the goals of robustness and effi...
متن کامل